Morphological Iterative Closest Point Algorithm

نویسندگان

  • C. P. Vavoulidis
  • Ioannis Pitas
چکیده

This work presents a method for the registration of three-dimensional (3-D) shapes. The method is based on the iterative closest point (ICP) algorithm and improves it through the use of a 3-D volume containing the shapes to be registered. The Voronoi diagram of the "model" shape points is first constructed in the volume. Then this is used for the calculation of the closest point operator. This way a dramatic decrease of the computational cost is achieved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A bounded iterative closest point method for minimally invasive registration of the femur.

This article describes a novel method for image-based, minimally invasive registration of the femur, for application to computer-assisted unicompartmental knee arthroplasty. The method is adapted from the well-known iterative closest point algorithm. By utilising an estimate of the hip centre on both the preoperative model and intraoperative patient anatomy, the proposed 'bounded' iterative clo...

متن کامل

An approximate EM Homographical Iterative Closest Point algorithm

This paper describes an approximately expectationmaximization (EM) formulation of a homographical iterative closest point registration approach (henceforth HICP). We show that such an EM approach allows the algorithm to converge faster, and more robustly in the presence of noise. Although this algorithm can register points transformed by a more general set of linear transformations than the ori...

متن کامل

Registration of Range Data Using a Hybrid Simulated Annealing and Iterative Closest Point Algorithm Authors

This paper presents a novel approach for registering two sets of 3-D range data points, using an optimization algorithm that is both robust and efficient. The algorithm combines the speed of an iterative closest point algorithm with the robustness of a simulated annealing algorithm. Additionally, a robust error function is incorporated to deal with outliers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on image processing : a publication of the IEEE Signal Processing Society

دوره 8 11  شماره 

صفحات  -

تاریخ انتشار 1997